Single-source k-splittable min-cost flows
نویسندگان
چکیده
Motivated by a famous open question on the single-source unsplittable minimum cost flow problem, we present a new approximation result for the relaxation of the problem where, for a given number k, each commodity must be routed along at most k paths. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Convex Combinations of Single Source Unsplittable Flows
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The demand of each commodity must be routed along a single path. In a groundbreaking paper Dinitz, Garg, and Goemans [4] prove that any given (splittable) flow satisfying certain demands can be turned into an unsplittable flow ...
متن کاملMinimum - cost single - source 2 - splittable flow ✩ Stavros
In the single-source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain sinks in a given directed graph with edge capacities and costs. The demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover the cost of the solution should not exceed a given budget. An impo...
متن کاملApproximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most k paths [6]. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems. Constructing a k–splittable flow requires two interdepending decisions. One has to decide ...
متن کاملSplittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice
In single chip multiprocessors (CMP) with grid topologies, a significant part of power consump-tion is attributed to communications between the cores of the grid. We investigate the problem ofrouting communications between CMP cores using shortest paths, in a model in which the powercost associated with activating a communication link at a transmission speed of f bytes/second is...
متن کاملFast Convergence of Routing Games with Splittable Flows
In this paper we investigate the splittable routing game in a seriesparallel network with two selfish players. Every player wishes to route optimally, i.e. at minimum cost, an individual flow demand from the source to the destination, giving rise to a non-cooperative game. We allow a player to split his flow along any number of paths. One of the fundamental questions in this model is the conver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 37 شماره
صفحات -
تاریخ انتشار 2009